CDoT: Optimizing MAP Queries on Trees
نویسندگان
چکیده
Among the graph structures underlying Probabilistic Graphical Models, trees are valuable tools for modeling several interesting problems, such as linguistic parsing, phylogenetic analysis, and music harmony analysis. In this paper we introduce CDoT, a novel exact algorithm for answering Maximum a Posteriori queries on tree structures. We discuss its properties and study its asymptotic complexity; we also provide an empirical assessment of its performances, showing that the proposed algorithm substantially improves over a dynamic programming
منابع مشابه
[4] Chiang Lee, Chi-Sheng Shih, and Yaw-Huei Chen. Optimizing large join queries using a graph-based approach. IEEE Trans. Knowl. Data Eng., 13(2):298–315, 2001.
References [1] Leonidas Fegaras. A new heuristic for optimizing large queries. [2] Toshihide Ibaraki and Tiko Kameda. On the optimal nesting order for computing n-relational joins. Optimizing large join queries using a graph-based approach. [5] Guido Moerkotte and Thomas Neumann. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees wi...
متن کاملQuery Processing and Optimization for Pictorial Query Trees
Methods for processing of pictorial queries speci ed by pictorial query trees are presented. Leaves of a pictorial query tree correspond to individual pictorial queries while internal nodes correspond to logical operations on them. Algorithms for processing individual pictorial queries and for parsing and computing the overall result of a pictorial query tree are presented. Issues involved in o...
متن کاملIEEE Trans. Knowl. Data Eng., 13(2):298–315, 2001.
References [1] Leonidas Fegaras. A new heuristic for optimizing large queries. [2] Toshihide Ibaraki and Tiko Kameda. On the optimal nesting order for computing n-relational joins. Optimizing large join queries using a graph-based approach. [5] Guido Moerkotte and Thomas Neumann. Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees wi...
متن کاملOptimizing Conjunctive Queries over Trees Using Schema Information
We study the containment, satisfiability, and validity problems for conjunctive queries over trees with respect to a schema. We show that conjunctive query containment and validity are 2EXPTIMEcomplete w.r.t. a schema (DTD or Relax NG). Furthermore, we show that satisfiability for conjunctive queries w.r.t. a schema can be decided in NP. The problem is NP-hard already for queries using only one...
متن کاملImproving Growth and Performance of Young Almond Trees in Nursery by Optimizing Mineral Nutrition
Short growing season restricts production of standard-sized fruit trees in nurseries at cold regions. Enhancing plant growth by optimizing program of mineral nutrition may solve the problem. This study evaluated efficiency of fertilizers [urea, sulfur coated urea (SCU), or foliar applications of a NPK compound fertilizer] for optimizing the growth of seedling rootstocks and grafted young almond...
متن کامل